Vector/Matrix Norms and Iterative Linear Solvers

نویسنده

  • Daniel R. Reynolds
چکیده

a. ‖x‖ ≥ 0 for all x ∈ IRn, and ‖x‖ = 0 if and only if x is the zero vector. b. ‖αx‖ = |α|‖x‖. c. ‖x+ y‖ ≤ ‖x‖+ ‖y‖ [called the “triangle inequality”]. While this may seem a bit esoteric, consider that if x ∈ IR1, i.e. if x is a real number, the absolute value function, | · |, satisfies all of the above properties, and therefore constitutes as a norm. Another familiar norm would be the Euclidean norm for vectors x ∈ IR2. Example 1 (Euclidean norm on IR2). Consider the vector [x, y] ∈ IR2. Then the function ‖ [x, y] ‖ = √ x2 + y2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative linear system solvers with approximate matrix-vector products

There are classes of linear problems for which a matrix-vector product is a time consuming operation because an expensive approximation method is required to compute it to a given accuracy. One important example is simulations in lattice QCD with Neuberger fermions where a matrix multiply requires the product of the matrix sign function of a large sparse matrix times a vector. The recent intere...

متن کامل

Iterative Solution of Dense Linear Systems

Integral equation methods have been used with great success in electromagnetic scattering calculations and in other problems involving unbounded computational domains. Their application is in many cases limited by the storage requirements of dense matrices and also by the rapidly increasing computational time. However, the use of iterative solvers and special methods for computing the matrix-ve...

متن کامل

On the Realistic Performance of Linear Algebra Components in Iterative Solvers

One of the main principles in the new FEM package FEAST 3] is a recursive Divide and Conquer strategy which in combination with the generalized solver approach ScaRC 2] allows a successive decomposition of`global' problems into smallerìocal' subproblems. On the lowest-leveìlocal' patches, highly regular data structures are preferred which allow the use of high-performance Numerical Linear Algeb...

متن کامل

Hybrid-Parallel Sparse Matrix–Vector Multiplication and Iterative Linear Solvers with the communication library GPI

We present a library of Krylov subspace iterative solvers built over the PGAS-type communication layer GPI. The hybrid pattern is here the appropriate choice to reveal the hierarchical parallelism of clusters with multiand manycore nodes. Our approach includes asynchronous communication and differs in many aspects from the classical one. We first present the GPI-based implementation of the spar...

متن کامل

Acceleration of GPU-based Krylov solvers via data transfer reduction

Krylov subspace iterative solvers are often the method of choice when solving large sparse linear systems. At the same time, hardware accelerators such as graphics processing units continue to offer significant floating point performance gains for matrix and vector computations through easy-to-use libraries of computational kernels. However, as these libraries are usually composed of a well opt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013